Boolean Abstractions for Realizability Modulo Theories

Abstract In this paper, we address the problem of (reactive) realizability specifications theories richer than Booleans, including arithmetic theories. Our approach transforms theory into purely Boolean by (1) substituting literals variables, and (2) computing an additional requirement that captures dependencies between new variables imposed literals. The resulting specification can be passed to existing off-the-shelf tools, is realizable if only original realizable. first contribution a brute-force version our method, which requires number SMT queries doubly exponential in input Then, present faster method exploits nested encoding search for extra uses SAT solving traversing space internally. Another prototype Z3-Python. Finally, report empirical evaluation using inspired real industrial cases. To best knowledge, succeeds non-Boolean LTL realizability.